optimize LazyBranch range getindex and return VoV #122
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Closes #113
With this PR,
Base.getindex(ba::LazyBranch{T,J,B}, range::UnitRange)
will read the right baskets, concatenate them, and chop off the edges to avoid the accumulated cost of many individualgetindex
s in[ba[i] for i in range]
(master
). And, the return value is now aVectorOfVectors
if it's a jagged branch.I'm using a zlib test file. The
40*10^6:43*10^6]
range has 5 baskets, while the1:10^6
range has 450 baskets. The improvement is more obvious for the first range.Out of curiosity I tested
append!()
and found it's basically the same asvcat
.master
by basket with vcat
by basket with append